Reducing Computational Time of Principal Component Analysis with Chinese Remainder Theorem

The Chinese Remainder Theorem

Parallel computational algorithms for generalized Chinese remainder theorem

Recently, the residue number system (RNS) has been intensively studied. The Chinese remainder theorem (CRT) is a solution to the conversion problem of a number to RNS with a general moduli set. This paper introduces the generalized CRT (GCRT) with parallel algorithms used for the conversion. The GCRT differs from the CRT because it has the advantage of having more applications than does the CRT...

Robustness in Chinese Remainder Theorem

Chinese Remainder Theorem (CRT) has been widely studied with its applications in frequency estimation, phase unwrapping, coding theory and distributed data storage. Since traditional CRT is greatly sensitive to the errors in residues due to noises, the problem of robustly reconstructing integers via the erroneous residues has been intensively studied in the literature. In order to robustly reco...

A Multivariable Chinese Remainder Theorem

Using an adaptation of Qin Jiushao’s method from the 13th century, it is possible to prove that a system of linear modular equations ai1xi + · · · + ainxn = ~bi mod ~ mi, i = 1, . . . , n has integer solutions if mi > 1 are pairwise relatively prime and in each row, at least one matrix element aij is relatively prime to mi. The Chinese remainder theorem is the special case, where A has only one...

IP traceback based on chinese remainder theorem

IP traceback is a defense method to help a victim to identifying the sources of attacking packets. In this paper, we propose an IP traceback method based on the Chinese Remainder Theorem to require routers to probabilistically mark packets with partial path information when packets traverse routers through the Internet. The routers with the proposed IP traceback method can interoperate seamless...